Maximum cut - PDFSEARCH.IO - Document Search Engine

Maximum cut
Results: 105

#	Item
31	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
32	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
33	Optimization Algorithms Lecture 23: Maximum Flows and Minimum Cuts [Fa’13] Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:41:28 Combinatorics Maximum flow problem Ford–Fulkerson algorithm Flow network Edmonds–Karp algorithm Max-flow min-cut theorem Minimum cut Cut Graph Network flow Graph theory Mathematics
34	Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998 p.648 Markov Random Fields with Efficient Approximations Yuri Boykov Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2004-09-12 22:08:02 Connectivity Dynamic programming Maximum flow problem Cut Mathematics Graph theory Applied mathematics
35	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and † Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-31 22:48:01 Spanning tree Network flow Graph connectivity Maximum flow problem Randomized algorithm Minimum spanning tree Connectivity Cut SL Theoretical computer science Graph theory Mathematics
36	Youn! ca Cut down on alcohol Top tips for reducing your alcohol intake Add to Reading List Source URL: docs.wcrf.org Language: English - Date: 2014-09-09 12:05:35 Drink Alcoholic beverage Rev Cider Alcopop Recommended maximum intake of alcoholic beverages Alcohol equivalence Medicine Food and drink Alcohol
37	CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:32:58 NP-complete problems Delaunay triangulation Triangulation Maximum flow problem Cut Shortest path problem Graph theory Mathematics Theoretical computer science
38	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:11 Theoretical computer science Maximum flow problem Flow network Minimum-cost flow problem Ford–Fulkerson algorithm Edmonds–Karp algorithm Shortest path problem Matching Max-flow min-cut theorem Graph theory Mathematics Network flow
39	Thesis for the degree ‫עבודת גמר (תזה) לתואר‬ Master of Science Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-22 08:25:27 Combinatorial optimization NP-complete problems Cut Streaming algorithm Maximum cut Hypergraph Time complexity Minimum cut Matching Theoretical computer science Graph theory Mathematics
40	Implicit Hitting Set Problems, Multi-Genome Alignment and Colorful Connected Subgraphs Richard M. Karp CPM New York, June, 2010 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:40 Combinatorics Matroid theory Combinatorial optimization Set cover problem Matroid Feedback vertex set Maximum cut Greedy algorithm Mathematics Theoretical computer science NP-complete problems

UPDATE